A Large Deviation Principle for Join the Shortest Queue
نویسندگان
چکیده
منابع مشابه
5 A large deviation principle for join the shortest queue
We consider a join-the-shortest-queue model which is as follows. There are K single FIFO servers and M arrival processes. The customers from a given arrival process can be served only by servers from a certain subset of all servers. The actual destination is the server with the smallest weighted queue length. The arrival processes are assumed to obey a large deviation principle while the servic...
متن کاملA Large Deviation Principle for Join the Shortest Queue
We consider a join-the-shortest-queue model which is as follows. There are K single FIFO servers and M arrival processes. The customers from a given arrival process can be served only by servers from a certain subset of all servers. The actual destination is the server with the smallest weighted queue length. The arrival processes are assumed to obey a large deviation principle while the servic...
متن کاملLarge deviations without principle: join the shortest queue
We develop a methodology for studying “large deviations type” questions. Our approach does not require that the large deviations principle holds, and is thus applicable to a large class of systems. We study a system of queues with exponential servers, which share an arrival stream. Arrivals are routed to the (weighted) shortest queue. It is not known whether the large deviations principle holds...
متن کاملLarge deviations methods and the join-the-shortest-queue model
We develop a methodology for studying “large deviations type” questions. Our approach does not require that the large deviations principle holds, and is thus applicable to a larg class of systems. We study a system of queues with exponential servers, which share an arrival stream. Arrivals are routed to the (weighted) shortest queue. It is not known whether the large deviations principle holds ...
متن کاملStability of join-the-shortest-queue networks
This paper investigates stability behavior in a variant of a generalized Jackson queueing network. In our network, some customers use a join-the-shortest-queue policy when entering the network or moving to the next station. Furthermore, we allow interarrival and service times to have general distributions. For networks with two stations we derive necessary and sufficient conditions for positive...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 2007
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.1070.0263